Support for Nested Preemption in nxtOSEK
نویسندگان
چکیده
In real-time computing scenarios, we are concerned with logical as well as temporal accuracy of the results. While developing algorithms or performing schedulability analysis, preemption overheads are usually ignored even, though it’s an operation that consumes finite amount of time. Preemption allows higher priority tasks to halt the lower priority tasks, though this need not be necessarily required to meet task deadlines. Our concern is not to get the results as soon as possible but soon enough to just meet the deadlines of all the tasks. Algorithms which meet deadlines and minimize preemptions in order to decrease overheads have been developed. The nxtOSEK is a Real-Time Operating System for the AT91SAM7S256 ARM7TDMI controller, with capabilities of ANSI-C/C++ programmability. The nxtOSEK kernel cannot be used to demonstrate any such algorithm, since it does not support nested preemption. The task scheduling in the nxtOSEK kernel is governed by a 1ms ISR routine. When a higher priority task preempts a lower priority task, it has been observed that this 1ms ISR(and hence the task scheduler) is suppressed for the duration of execution of the higher priority task. This causes an equivalent shift in the release times of all the subsequent tasks and the entire timing behaviour of the nxtOSEK kernel is skewed. The nxtOSEK kernel has been purposefully designed to prevent successive instances of preemption i.e. the kernel does not support a case where after one preemption event, while the preempting task is yet to finish its execution, it is preempted in turn by an even higher priority task. In this project, we attempted to resolve this by modifying the current kernel behavior. The article has been divided into five sections, Background, that explains the current kernel behavior and highlights the problem in it, Design, that encompasses the suggested modifications in the kernel, Implementation, depicting the changes done to achieve the goal, Validation, defines the test-cases used to test the modified kernel and Results,presenting the output of the modification.
منابع مشابه
Scheduling a constellation of agile earth observation satellites with preemption
In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...
متن کاملReactivity, Concurrency, Data--ow and Hierarchical Preemption for Behavioural Animation
Behavioural models ooer the ability to simulate autonomous entities like organisms and living beings. Such entities are able to perceive their environment, to communicate with other creatures and to execute some decided actions either on themselves or on their environment. Building such systems requires the design of a reactive system treating ows of data to and from its environment, in a compl...
متن کاملModifying the Black-Scholes model to valuate preemption right
In this paper, we try and valuate preemption rights by modifying the Black-Scholes model, which is widely used to valuate options and other derivatives. Here we first present the basics of the Black-Scholes model and then we discus modification of the model to be fit for preemption right valuation. At the end, we valuate four of the preemptive rights using the proposed model
متن کاملExplicit Preemption Placement for Real-Time Conditional Code1
In the limited-preemption scheduling model, tasks cooperate to offer suitable preemption points for reducing the overall preemption overhead. In the fixed preemption-point model, tasks are allowed to preempt only at statically defined preemption points, reducing the variability of the preemption delay and making the system more predictable. Different works have been proposed to determine the op...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کامل